There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists
نویسندگان
چکیده
In this paper we prove that in some practical situations, there is a free lunch for hyper-heuristics, i.e., for search algorithms that search the space of solvers, searchers, meta-heuristics and heuristics for problems. This has consequences for the use of genetic programming as a method to discover new search algorithms and, more generally, problem solvers. Furthermore, it has also rather important philosophical consequences in relation to the efforts of computer scientists to discover useful novel search algorithms.
منابع مشابه
Some Ideas about No-Free Lunch for Hyper-Heuristics
In this paper we prove that in some practical situations, there is a free lunch for hyper-heuristics, i.e., search algorithms that search the space of solvers, searchers, meta-heuristics and heuristics for problems.
متن کاملA Genetic Programming Hyper-Heuristic Approach for Evolving
We present a genetic programming hyper-heuristic system to evolve a ‘disposable’ heuristic for each of a wide range of benchmark instances of the two-dimensional strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. Usually, there is a trade-off between the generality of a packi...
متن کاملA Genetic Programming Hyper-Heuristic Approach for Evolving Two Dimensional Strip Packing Heuristics
We present a genetic programming system to evolve reusable heuristics for the two dimensional strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. This work contributes to a growing research area which represents a paradigm shift in search methodologies. Instead of using evolut...
متن کاملA Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of heuristics or combinations of heuristics, i.e. hyper-heuristics, to be used in the construction of examination timetables. The study presented in t...
متن کاملGenetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line
This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...
متن کامل